On the Disjunctive Graph for Project Scheduling
نویسنده
چکیده
An extension of the Disjunctive Model, eeciently representing Jobshop Scheduling (JS) problem, to more general Resource-Constrained Project Scheduling (RCPS) problem is proposed. The extension considers diierent groups of resources used by activities in diierent amounts limited to a constant value in every moment of the project duration. A solution to the problem is represented by a project resource ow diagram. Two kinds of project resource ow modiications | serial and parallel | are proposed in order to deene a good neighborhood structure. This allows to eeciently apply local search techniques like Simulated Annealing or Tabu Search.
منابع مشابه
Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملAn Implementation View on Job Shop Scheduling Based on CPM
The scheduling of manufacturing processes aims to find sequences of jobs on given machines optimal by a selected criterion, e.g. minimal completion time of all operations. With respect to NP-hardness of these problems and the necessity to solve them by heuristic methods, the problem representation and the effectiveness of their procedures is substantial for computations to be completed in a rea...
متن کاملA Tabu Search Algortihm for the Railway Scheduling Problem
Aim of this presentation is to introduce a tabu search algorithm for a general scheduling problem modeled by means of the alternative graph. The alternative graph is a mathematical model, which is based on a generalization of the disjunctive graph of Roy and Sussman [6]. It allows a detailed representation of many scheduling problems. It was successfully applied to several real world environmen...
متن کاملModified Pareto archived evolution strategy for the multi-skill project scheduling problem with generalized precedence relations
In this research, we study the multi-skill resource-constrained project scheduling problem, where there are generalized precedence relations between project activities. Workforces are able to perform one or several skills, and their efficiency improves by repeating their skills. For this problem, a mathematical formulation has been proposed that aims to optimize project completion time, reworki...
متن کامل